Euclidean Functions of Computable Euclidean Domains
نویسندگان
چکیده
منابع مشابه
Euclidean Functions of Computable Euclidean Domains
We study the complexity of (finitely-valued and transfinitely-valued) Euclidean functions for computable Euclidean domains. We examine both the complexity of the minimal Euclidean function and any Euclidean function. Additionally, we draw some conclusions about the proof-theoretical strength of minimal Euclidian functions in terms of Reverse Mathematics.
متن کاملRemarks about Euclidean Domains
We will call (1) the d-inequality. Sometimes it is expressed in a different way: for nonzero a and b, if a|b then d(a) ≤ d(b). This is equivalent to the d-inequality, taking into account of course the different roles of a and b in the two descriptions. Examples of Euclidean domains are Z (with d(n) = |n|), F [T ] for any field F (with d(f) = deg f ; this example is the reason that one doesn’t a...
متن کاملComputable Closed Euclidean Subsets with and without Computable Points
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskiı̆, Tseı̆tin, Kreisel, and Lacombe have asserted the existence of non-empty co-r.e. closed sets devoid of computable points: sets which are even ‘large’ in the sense of positive Lebesgue measure. This leads us to investigate for various classes of computable real subsets whether they necess...
متن کاملWeak Metrics on Euclidean Domains
A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. The aim of this paper is to present some interesting weak metrics and to study some of their properties. In particular, we introduce a weak metric, called the Apollonian weak metric, on any subset of a Euclidean space which is either bounded or whose boundary is unbounded. W...
متن کاملHoles and Maps of Euclidean Domains
We study the behavior of the quasiconvexity and bounded turning of holes of domains under quasisymmetric and bilipschitz maps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2011
ISSN: 0029-4527
DOI: 10.1215/00294527-1306172